The Complexity of Checking Identities over Finite Groups
نویسندگان
چکیده
We analyze the computational complexity of solving a single equation and checking identities over finite meta-abelian groups. Among others we answer a question of Goldmann and Russel from 1998: we prove that it is decidable in polynomial time whether or not an equation over the six-element group S 3 has a solution.
منابع مشابه
Computational Complexity of Checking Identities in 0-simple Semigroups and Matrix Semigroups over Finite Fields
In this paper we analyze the so called word-problem for (finite) combinatorial 0-simple semigroups and matrix semigroups from the viewpoint of computational complexity.
متن کاملEfficient implementation of low time complexity and pipelined bit-parallel polynomial basis multiplier over binary finite fields
This paper presents two efficient implementations of fast and pipelined bit-parallel polynomial basis multipliers over GF (2m) by irreducible pentanomials and trinomials. The architecture of the first multiplier is based on a parallel and independent computation of powers of the polynomial variable. In the second structure only even powers of the polynomial variable are used. The par...
متن کاملFirst-Order Queries on Finite Abelian Groups
We study the computational problem of checking whether a logical sentence is true in a finite abelian group. We prove that model checking first-order sentences on finite abelian groups is fixed-parameter tractable, when parameterized by the size of the sentence. We also prove that model checking monadic second-order sentences on finite abelian groups finitely presented by integer matrices is no...
متن کاملThe Rogers - Ramanujan Identities , the Finite General Linear Groups , and theHall
The Rogers-Ramanujan identities have been studied from the viewpoints of combinatorics, number theory, a ne Lie algebras, statistical mechanics, and conformal eld theory. This note connects the Rogers-Ramanujan identities with the nite general linear groups and the HallLittlewood polynomials of symmetric function theory.
متن کاملThe Identity Checking Problem for Semigroups
In this paper, we consider the identity checking problem for semi-groups. We propose a genetic algorithm to solve the problem. There is a considerable interest in investigation of semigroup identities (see e.g. [1] – [4]). In particular, the identity checking problem for finite semigroups is extensively studied (see e.g. [5] and references in [5]). The identity checking problem in semigroup A i...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- IJAC
دوره 16 شماره
صفحات -
تاریخ انتشار 2006